#!/usr/bin/env python

# Find the number of non-empty subsets of {11, 22, 33,..., 250250250250}, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer.

if __name__ == "__main__":
	# seq = [ i for i in xrange(1, 250251) if i % 250 == 0 ]
	seq = []
	i = 250
	while i < 250251:
		seq.append(i)
		i += 250
	# print seq	
	
	seqp = []
	for n in seq:
		mul = 1
	 	for k in xrange(1, n+1):
			#print "n = ", n
			mul *= n
			#if len(str(mul)) > 20 :
			#	mul = int(str(mul)[-20:])
				#assert mul != 0
			#else:
			#	assert mul != 0
		seqp.append(mul)
		print seqp
